Lindelöf indestructibility, topological games and selection principles
نویسندگان
چکیده
Arhangel’skii proved that if a first countable Hausdorff space is Lindelöf, then its cardinality is at most 20 . Such a clean upper bound for Lindelöf spaces in the larger class of spaces whose points are Gδ has been more elusive. In this paper we continue the agenda started in [50], of considering the cardinality problem for spaces satisfying stronger versions of the Lindelöf property. Infinite games and selection principles, especially the Rothberger property, are essential tools in our investigations. A topological space is Lindelöf if each open cover contains a countable subset that covers the space. Alexandrov asked if in the class of first countable Hausdorff spaces, every Lindelöf space has cardinality at most 20 . Arhangel’skii [1] proved that the answer is “yes”. This focuses attention on the larger class of spaces in which “points are Gδ” i.e., the class of topological spaces in which each point is an intersection of countably many open sets. Such spaces are T1 but not necessarily Hausdorff. Arhangel’skii showed that in the class of spaces with points Gδ each Lindelöf space has cardinality less than the least measurable cardinal. Juhász [26] showed that this bound is sharp: There are such Lindelöf spaces of arbitrary large cardinality below the least measurable cardinal. Juhász’s examples are not Hausdorff spaces and the cardinality of the underlying spaces has countable cofinality. Shelah [44] showed that no Lindelöf space with points Gδ can be of weakly compact cardinality. Gorelic [19] showed that it is relatively consistent that the Continuum Hypothesis (CH) holds, that 21 is arbitrarily large, and there is a zero-dimensional regular Lindelöf space with points Gδ and of cardinality 2 א1 . This improved earlier results of Shelah [44], Shelah-Stanley [45] and Velleman [58] which showed that either by countably closed forcing, or by assuming V=L, one could obtain such a space of cardinality א2, consistent with CH. Little else is known about cardinality Research supported by Grant A-7354 of the Natural Sciences and Engineering Research Council of Canada
منابع مشابه
Using games in Oncology Teaching
Introduction:Educational methods can be classified into two groups: active methods and passive ones. Applying games is an active approach in teaching. The present study aimed at investigating the effect of games on teaching oncology. Methods: Twenty three medical students participated in the study. They took two class sessions of oncology. In the first session the basic principles and concepts...
متن کاملUnprepared Indestructibility
I present a forcing indestructibility theorem for the large cardinal axiom Vopěnka’s Principle. It is notable in that there is no preparatory forcing required to make the axiom indestructible, unlike the case for other indestructibility results. §
متن کاملTopological Games and Covering Dimension
We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on the class of separable metric spaces. One of our examples of such an ordinal function coincides in any finit...
متن کاملPhragmén-lindelöf Principles on Algebraic Varieties
From several results in recent years, starting with Hörmander’s characterization of the constant coefficient partial differential equations P (D)u = f that have a real analytic solution u for every real analytic function f , it has become clear that certain properties of the partial differential operator P (D) are equivalent to estimates of Phragmén–Lindelöf type for plurisubharmonic functions ...
متن کاملForcing indestructibility of MAD families
Let A ⊆ [ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families wh...
متن کامل